Robust Stopping Criteria for Dykstra's Algorithm
نویسندگان
چکیده
منابع مشابه
Robust Stopping Criteria for Dykstra's Algorithm
Dykstra’s algorithm is a suitable alternating projection scheme for solving the optimization problem of finding the closest point to a given one in the intersection of a finite number of closed and convex sets. It has been recently used in a wide variety of applications. However, in practice, the commonly used stopping criteria are not robust and could stop the iterative process prematurely at ...
متن کاملDykstra's Algorithm and Robust Stopping Criteria
where Ωi are closed and convex sets in IR , for i = 1, 2, . . . , p, and Ω 6= ∅. Moreover, we assume that for any z ∈ IR the calculation of PΩ(z) is not trivial; whereas, for each Ωi, PΩi(z) is easy to obtain as in the case of a box, an affine subspace, or Department of Computer Science IME-USP, University of São Paulo, Rua do Matão 1010, Cidade Universitária, 05508-090, São Paulo SP, Brazil. T...
متن کاملStopping Criteria for SVMs
The support vector machine has been shown to be comparable to the state of the art for classification. In certain situations however, the convergence to a global optimum of the optimization problem can be very slow. It is shown that solutions suboptimal in terms of the optimization problem can still have very good performance. By using a heuristic stopping criterion (termed HERMES) these soluti...
متن کاملStopping Criteria for Mixed Finite Element Problems
Abstract. We study stopping criteria that are suitable in the solution by Krylov space based methods of linear and non linear systems of equations arising from the mixed and the mixed-hybrid finite-element approximation of saddle point problems. Our approach is based on the equivalence between the Babuška and Brezzi conditions of stability which allows us to apply some of the results obtained i...
متن کاملStopping Criteria for Single-Objective Optimization
In most literature dealing with evolutionary algorithms the stopping criterion consists of reaching a certain number of objective function evaluations (or a number of generations, respectively). A disadvantage is that the number of function evaluations that is necessary for convergence is unknown a priori, so trialand-error methods have to be applied for finding a suitable number. By using othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2005
ISSN: 1064-8275,1095-7197
DOI: 10.1137/03060062x